Building an iterative heuristic solver for a quantum annealer
نویسندگان
چکیده
منابع مشابه
Building an iterative heuristic solver for a quantum annealer
A quantum annealer heuristically minimizes quadratic unconstrained binary optimization (QUBO) problems, but is limited by the physical hardware in the size and density of the problems it can handle. We have developed a meta-heuristic solver that utilizes D-Wave Systems’ quantum annealer (or any other QUBO problem optimizer) to solve larger or denser problems, by iteratively solving subproblems,...
متن کاملAn iterative solver benchmark
In scientific computing, several benchmarks exist that give a user some idea of the to-be-expected performance given a code and a specific computer. One widely accepted performance measurement is the Linpack benchmark [4], which evaluates the efficiency with which a machine can solve a dense system of equations. Since this operation allows for considerable reuse of data, it is possible to show ...
متن کاملConstructing SAT Filters with a Quantum Annealer
SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They have the potential to store more information in a fixed storage limit than a Bloom filter. Constructing a SAT filter requires sampling diverse solutions to randomly constructed constraint satisfaction instances, but there is flexibility in the choice of constraint sati...
متن کاملBoosting quantum annealer performance via quantum persistence
We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected co...
متن کاملTraffic Flow Optimization Using a Quantum Annealer
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems [1], have been subject to multiple analyses in research, with the aim of characterizing the technology’s usefulness for optimization and sampling tasks ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2016
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-016-9844-y